A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief

نویسندگان

  • Michael Wooldridge
  • Clare Dixon
  • Michael Fisher
چکیده

In this paper we deene two logics, KL n and BL n , and present tableau-based decision procedures for both. KL n is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BL n is somewhat similar; it is a temporal logic that contains connectives for representing the beliefs of agents. In addition to a complete formal deenition of the two logics and their decision procedures, the paper includes a brief review of their applications in AI and mainstream computer science, correctness proofs for the decision procedures, a number of worked examples illustrating the decision procedures, and some pointers to further work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cut-free Tableau Calculus for the Logic of Common Knowledge

In this paper we focus on the development of a cut-free finitary tableau calculus with histories for n-agent modal logics with common knowledge (LCK). Thus, we get a proof system where proof-search becomes feasible and we lay the basis for developing a uniform framework for the treatment of the family of logics of common knowledge. Unlike proof calculi based on temporal logics, our calculus giv...

متن کامل

A General Tableau Method for Propositional Interval Temporal Logics

In this paper, we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau met...

متن کامل

Labelled Tableaux for Multi-Modal Logics

In this paper we present a tableau-like proof system for multi-modal logics based on D’Agostino and Mondadori’s classical refutation system KE [DM94]. The proposed system, that we call KEM , works for the logics S5A and S5P(n) which have been devised by Mayer and van der Hoek [MvH92] for formalizing the notions of actuality and preference. We shall also show howKEM works with the normal modal l...

متن کامل

A Tableau Proof System for a Mazurkiewicz Trace Logic with Fixpoints

We present a tableau based proof system for TrTL, a trace based temporal logic with xpoints. The proof system generalises similar systems for standard interleaving temporal logics with xpoints. In our case special attention has to be given to the modal rule: First we give a system with an interleaving style modal rule, later we use a technique similar to the sleep set method (known from nite st...

متن کامل

One-Pass Tableaux for Computation Tree Logic

We extend Schwendimann’s single-pass decision procedure for propositional linear temporal logic (PLTL) to give a single-pass tableau decision procedure for computational tree logic (CTL). The extension is non-trivial because the soundness proof requires a careful analysis of the interactions between the branching inherent in CTL-models, which is missing in PLTL-models, with the “or” branching i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Applied Non-Classical Logics

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1998